From MQ to MQQ Cryptography: Weaknesses & New Solutions
نویسندگان
چکیده
Public Key Cryptosystems have been in use for more than three decades. A number of schemes based on integer factorization problem, discrete log problem, residuosity problem, digital signature methods, Lucas sequence, Lattice problems, error-correcting codes, braid groups etc. have been designed. Recently, Multivariate Quadratic (MQ) Polynomials could be efficiently used for design of a number of interesting cryptosystems. However, successful attacks on some of these schemes encouraged researchers to design new trapdoor functions suitable for present cryptographic applications. Multivariate Quadratic Quasigroup (MQQ) has been one of the latest ideas in this direction but is limited to the construction of MQQ of lower orders. Our significant contribution in this direction is efficient generation of MQQs of higher order suitable for design of secure public key cryptosystems.
منابع مشابه
MQQ-SIG - An Ultra-Fast and Provably CMA Resistant Digital Signature Scheme
We present MQQ-SIG, a signature scheme based on “Multivariate Quadratic Quasigroups”. The MQQ-SIG signature scheme has a public key consisting of n 2 quadratic polynomials in n variables where n = 160, 192, 224 or 256. Under the assumption that solving systems of n 2 MQQ’s equations in n variables is as hard as solving systems of random quadratic equations, we prove that in the random oracle mo...
متن کاملThe Multivariate Probabilistic Encryption Scheme MQQ-ENC
We propose a new multivariate probabilistic encryption scheme with decryption errors MQQ-ENC that belongs to the family of MQQ-based public key schemes. Similarly to MQQ-SIG, the trapdoor is constructed using quasigroup string transformations with multivariate quadratic quasigroups, and a minus modifier with relatively small and fixed number of removed equations. To make the decryption possible...
متن کاملAn algorithm for judging and generating multivariate quadratic quasigroups over Galois fields
As the basic cryptographic structure for multivariate quadratic quasigroup (MQQ) scheme, MQQ has been one of the latest tools in designing MQ cryptosystem. There have been several construction methods for MQQs in the literature, however, the algorithm for judging whether quasigroups of any order are MQQs over Galois fields is still lacking. To this end, the objective of this paper is to establi...
متن کاملA Polynomial-Time Key-Recovery Attack on MQQ Cryptosystems
We investigate the security of the family of MQQ public key cryptosystems using multivariate quadratic quasigroups (MQQ). These cryptosystems show especially good performance properties. In particular, the MQQ-SIG signature scheme is the fastest scheme in the ECRYPT benchmarking of cryptographic systems (eBACS). We show that both the signature scheme MQQ-SIG and the encryption scheme MQQ-ENC, a...
متن کاملAn Algorithm for Judging and Generating Bilinear Multivariate Quadratic Quasigroups
Multivariate Quadratic Quasigroups (MQQs) as a suitable class of quasigroups for multivariate public key cryptography recently have been an important mathematical tool in information security field. In this paper, we propose a necessary and sufficient condition to verify whether a quasigroup given by its multiplication table is a bilinear MQQ, which shows that checking whether an arbitrary quas...
متن کامل